As-Is Approximate Computing

نویسندگان

چکیده

Although approximate computing promises better performance for applications allowing marginal errors, dearth of hardware support and lack run-time accuracy guarantees makes it difficult to adopt. We present As-Is, an Anytime Speculative Interruptible System that takes program executes with time-proportional approximations. That is, version the output is generated early gradually refined over time, thus providing guarantee eventually reaching 100% accuracy. The novelty our As-Is architecture in its ability conceptually marry speculative computing. show how existing innovations architectures can be repurposed anytime, best-effort approximation, facilitating design efforts overheads needed support. provides a platform real-time constraints interactive users interrupt programs accept their current results as is. always guaranteed if more time spared. Our evaluations demonstrate favorable performance-accuracy tradeoffs range applications.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Imprecise Minority-Based Full Adder for ‎Approximate Computing Using CNFETs

   Nowadays, the portable multimedia electronic devices, which employ signal-processing modules, require power aware structures more than ever. For the applications associating with human senses, approximate arithmetic circuits can be considered to improve performance and power efficiency. On the other hand, scaling has led to some limitations in performance of nanoscale circuits. According...

متن کامل

Computing Approximate Diagnoses By Using Approximate Entailment

The most widely accepted models of diagnostic reasoning are all phrased in terms of the logical consequence relations. In work in recent years, Schaerf and Cadoli have proposed e cient approximations of the classical consequence relation. The central idea of this paper is to parameterise the notion of diagnosis over di erent approximations of the consequence relation. This yields a number of di...

متن کامل

Modeling Approximate Computing Techniques

The efficiency–accuracy trade-off of approximate computing spans a diverse array of techniques at both the hardware and software levels. While this diversity is key to the success of approximation research, it also entails considerable complexity in developing and validating new approximation techniques. Researchers must relate their ideas to a vast body of work on approximate computing and inv...

متن کامل

Computing Approximate PSD Factorizations

We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error. The main ingredient is an exact factorization algorithm when the rows and columns of the factors are constrained to lie in a general polyhedron. This strictly...

متن کامل

Computing Approximate Radicals using Bezoutians

Consider I ⊂ C[x1, . . . , xm], a zero dimensional complete intersection ideal, with I = (f1, . . . , fm). Assume that I has clusters of roots, each cluster of radius at most ε in the ∞-norm. We compute the “approximate radical” of I, i.e. an ideal which contains one root for each cluster, corresponding to the center of gravity of the points in the cluster, up to an error term asymptotically bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Architecture and Code Optimization

سال: 2022

ISSN: ['1544-3973', '1544-3566']

DOI: https://doi.org/10.1145/3559761